bush packing - translation to russian
Diclib.com
ChatGPT AI Dictionary
Enter a word or phrase in any language 👆
Language:

Translation and analysis of words by ChatGPT artificial intelligence

On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:

  • how the word is used
  • frequency of use
  • it is used more often in oral or written speech
  • word translation options
  • usage examples (several phrases with translation)
  • etymology

bush packing - translation to russian

CLASS OF OPTIMIZATION PROBLEMS IN MATHEMATICS THAT INVOLVE ATTEMPTING TO PACK OBJECTS TOGETHER INTO CONTAINERS. THE GOAL IS TO EITHER PACK A SINGLE CONTAINER AS DENSELY AS POSSIBLE OR PACK ALL OBJECTS USING AS FEW CONTAINERS AS POSSIBLE
Square packing; Efficiency in packing; Optimal packing; Packing problem
  • The optimal packing of 15 circles in a square
  • The hexagonal packing of circles on a 2-dimensional Euclidean plane.
  • [[Sphere]]s or [[circle]]s packed loosely (top) and more densely (bottom)

bush packing      
кольцевая втулка
packing density         
FRACTION OF SPACE FILLED IN A PACKING
Packing Fraction; Packing Density; Packing constant

общая лексика

плотность записи

число единиц памяти, умещающееся на единице длины носителя. Измеряется обычно в битах на дюйм

Смотрите также

bpi

lattice packing         
  •  year = 2011 }}</ref>
  • Regular arrangement of equal spheres in a plane changing to an irregular arrangement of unequal spheres (bubbles).
AN ARRANGEMENT OF NON-OVERLAPPING SPHERES WITHIN A CONTAINING SPACE
Packing and covering; Lattice packing; Sphere-packing or hamming bound; Sphere-packing; Sphere packing problem; Lattice packing problem; Hamming sphere; Unequal sphere packing; Hypersphere packing

математика

решетчатая укладка

Definition

packing density
¦ noun Computing the density of stored information in terms of bits per unit occupied of its storage medium.

Wikipedia

Packing problems

Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.

In a bin packing problem, you are given:

  • A container, usually a two- or three-dimensional convex region, possibly of infinite size. Multiple containers may be given depending on the problem.
  • A set of objects, some or all of which must be packed into one or more containers. The set may contain different objects with their sizes specified, or a single object of a fixed dimension that can be used repeatedly.

Usually the packing must be without overlaps between goods and other goods or the container walls. In some variants, the aim is to find the configuration that packs a single container with the maximal packing density. More commonly, the aim is to pack all the objects into as few containers as possible. In some variants the overlapping (of objects with each other and/or with the boundary of the container) is allowed but should be minimized.

What is the Russian for bush packing? Translation of &#39bush packing&#39 to Russian